Categorical polynomial entropy

نویسندگان

چکیده

For classical dynamical systems, the polynomial entropy serves as a refined invariant of topological entropy. In setting categorical that is, triangulated categories endowed with an endofunctor, we develop theory entropy, refining defined by Dimitrov-Haiden-Katzarkov-Kontsevich. We justify this notion showing for automorphism smooth projective variety, pullback functor on derived category coincides growth rate induced action cohomology. also establish in general Yomdin-type lower bound endofunctor terms endomorphism numerical Grothendieck group category. As examples, compute some standard functors like shifts, Serre functors, tensoring line bundles, automorphisms, spherical twists, P-twists, and so on, illustrating clearly how refines study enables us to phenomenon trichotomy. A parallel mass is developed presence Bridgeland stability conditions.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Holo-Entropy Based Categorical Data Hierarchical Clustering

Clustering high-dimensional data is a challenging task in data mining, and clustering high-dimensional categorical data is even more challenging because it is more difficult to measure the similarity between categorical objects. Most algorithms assume feature independence when computing similarity between data objects, or make use of computationally demanding techniques such as PCA for numerica...

متن کامل

Entropy and the clique polynomial

This paper gives a sharp lower bound on the spectral radius ρ(A) of a reciprocal Perron–Frobenius matrix A ∈ M2g(Z), and shows in particular that ρ(A) ≥ (3 + √ 5)/2. This bound supports conjectures on the minimal entropy of pseudo-Anosov maps. The proof is based on a study of the curve complex of a directed graph.

متن کامل

On Approximating the Entropy of Polynomial Mappings

We investigate the complexity of the following computational problem: POLYNOMIAL ENTROPY APPROXIMATION (PEA): Given a low-degree polynomial mapping p : F → F, where F is a finite field, approximate the output entropy H(p(Un)), where Un is the uniform distribution on F and H may be any of several entropy measures. We show: • Approximating the Shannon entropy of degree 3 polynomials p : F2 → F2 o...

متن کامل

Polynomial Invariants of Graphs and Totally Categorical Theories

In the analysis of the structure of totally categorical first order theories, the second author showed that certain combinatorial counting functions play an important role. Those functions are invariants of the structures and are always polynomials in one or many variables, depending on the number of independent dimensions of the theory in question. The first author introduced the notion of gra...

متن کامل

Real Polynomial Diffeomorphisms with Maximal Entropy: Tangencies

The problem of understanding the dynamical behavior of diffeomorphisms has played a central role in the field of dynamical systems. One way of approaching this question is to ask about generic behavior in the space of diffeomorphisms. Another way to approach it is to ask about behavior in some specific parametrized family. The family of diffeomorphisms of R introduced by Hénon has often played ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Mathematics

سال: 2021

ISSN: ['1857-8365', '1857-8438']

DOI: https://doi.org/10.1016/j.aim.2021.107655